Safe Implementability of Regular Message Sequence Chart Specifications
نویسندگان
چکیده
Message Sequence Charts (MSCs) are drawn by software designers in order to model the typical behaviors of some communication protocol at an early stage of its design. The important question of whether some given set of scenarios is realizable by some message passing system has already been investigated in different ways. We consider here deadlock-free implementations up to additional message contents. We present an algorithm to check safe implementability of MSC specifications in the framework of non-FIFO channels. Our criterion turns out to have the same complexity bounds as the restrictive approach of Alur et al. [1] where no additional message content is allowed.
منابع مشابه
1 Implementability of Message Sequence Charts *
In [1], we have introduced an approach for the generation of SDL process specifications from a basic MSC. The translation is constrained by the provided architecture for the system. We extended our approach to handle inline constructs such as alt, opt, seq, etc. We came across the problem of non-implementability of MSCs for given architectures. This paper focuses on the implementability issue. ...
متن کاملNetcharts: Bridging the gap between HMSCs and executable specifications
We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects. (i) Netcharts admit a natural and direct translation into communicating finite-state machines, unlike HMSCs, for which the realization problem is nontrivi...
متن کاملModel checking time-constrained scenario-based specifications
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with timing constraints. Our system model is a network of communicating finite state machines with local clocks, whose global behaviour can be regarded as a timed automaton. Our goal is to verify that all timed behaviours e...
متن کاملChecking conformance for time-constrained scenario-based specifications
a r t i c l e i n f o a b s t r a c t We consider the problem of model checking message-passing systems with real-time requirements. As behavioral specifications, we use message sequence charts (MSCs) annotated with timing constraints. Our system model is a network of communicating finite state machines with local clocks, whose global behavior can be regarded as a timed automaton. Our goal is t...
متن کاملA Hierarchy of Communication Models for Message Sequence Charts
In a Message Sequence Chart (MSC) the dynamical behaviour of a number of cooperating processes is depicted. An MSC defines a partial order on the communication events between these processes. This order determines the physical architecture needed for implementing the specified behaviour, such as a FIFO buffer between each of the processes. In a systematic way, we define 50 communication models ...
متن کامل